4 research outputs found
FAXY: Fault Aware Routing Algorithm Based on XY Algorithm for Network on Chip
The performance of Network-on-Chip (NoC) largely depends on the underlying routing techniques. In this paper we present and evaluate a Fault aware routing algorithm scheme called FAXY based on XY routing algorithm. The simulation results show the effectiveness of FAXY by comparing it with XY routing schemes under different traffic patterns. Simulation results depict that the proposed routing algorithm is able to route packet even in the case of faulty links or switches in the NoC. Moreover, simulation results demonstrate the advantage of FAXY routing algorithm in terms of average packet latency, packet loss rate compared with XY routing algorithm in the presence of permanent faults. For the proposed algorithm, it can get much less average packet latency (10%) and lead to less than average 15% packet loss rate
Detection of Communities on Social Networks Based on Label Propagation Algorithm and Fuzzy Methods
The proliferation of the web and social networks has made people more connected to their friends and neighbors than ever beforeâ. âThe desire of individuals to relate to similar tastes and choices in a social network leads to the formation of clusters or virtual communitiesâ. âSuch information can be useful for commercialâ, âeducational or developmental purposes and therefore a large number of algorithms for detecting communities have been presentedâ. âThere are many algorithms for detecting communities on social networksâ. âIn this paperâ, âusing the label propagation algorithm and fuzzy Delphi methodâ, âan improved method is presented that can identify communities more accurately and quickly than other similar methodsâ. âAccordinglyâ, âin the proposed algorithmâ, âinstead of randomly selecting from the maximum labels of the neighboring nodesâ, âthe label with the highest weight is chosenâ. âBy doing thisâ, ârandom selection is eliminatedâ, âand stability and certainty in the outcomes of the algorithm are achievedâ